Random Subcubes as a Toy Model for Constraint Satisfaction Problems
نویسندگان
چکیده
منابع مشابه
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the solution space of the random ksatisfiability and k-coloring problems, and undergoes the same phase transitions as these problems. The comparison becomes quantitative in the large-k limit. Distance properties, as well t...
متن کاملRandom Constraint Satisfaction Problems
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r = m/n where solutions are known to exist with probability close to one due to non-constructive arguments. However, no algorithms are known to find solutions efficiently with a non-vanishing probability at e...
متن کاملA general model and thresholds for random constraint satisfaction problems
In this paper, we study the relation among the parameters in their most general setting that define a large class of random CSP models d-k-CSP where d is the domain size and k is the length of the constraint scopes. The model d-k-CSP unifies several related models such as the model RB and the model k-CSP. We prove that the model d-k-CSP exhibits exact phase transitions if k ln d increases no sl...
متن کاملImplicit Random Constraint Satisfaction Problems
Random CSPs (Constraint Satisfaction Problems) provide interesting benchmarks for experimental evaluation of algorithms. From a theoretical point of view, a lot of recent works have contributed to guarantee the existence of a so-called phase transition and, consequently, of hard and large problem instances. From a practical point of view, due to exponential space complexity, a vast majority of ...
متن کاملModels for Random Constraint Satisfaction Problems
We introduce a class of models for random Constraint Satisfaction Problems This class includes and generalizes many previously studied models We characterize those models from our class which are asymptot ically interesting in the sense that the limiting probability of satis ability changes signi cantly as the number of constraints increases We also dis cuss models which exhibit a sharp thresho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2008
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-008-9543-x